A Matrix Characterization for Multiplicative Exponential Linear Logic
نویسندگان
چکیده
منابع مشابه
The Relational Model Is Injective for Multiplicative Exponential Linear Logic
We prove a completeness result for Multiplicative Exponential Linear Logic (MELL): we show that the relational model is injective for MELL proof-nets, i.e. the equality between MELL proof-nets in the relational model is exactly axiomatized by cut-elimination. In the seminal paper by Harvey Friedman [11], it has been shown that equality between simply-typed lambda terms in the full typed structu...
متن کاملA Non-commutative Extension of Multiplicative Exponential Linear Logic
We extend multiplicative exponential linear logic (MELL) by a noncommutative, self-dual logical operator. The extended system, called NEL, is defined in the formalism of the calculus of structures, which is a generalisation of the sequent calculus and provides a more refined analysis of proofs. We are then able to extend the expressiveness of MELL by modelling a broad notion of sequentiality. W...
متن کاملA By-Level Analysis of Multiplicative Exponential Linear Logic
We study the relations betweenMultiplicative Exponential Linear Logic (meLL) and Baillot-Mazza Linear Logic by Levels (mL). We design a decoration-based translation between propositional meLL and propositional mL. The translation preserves the cut elimination. Moreover, we show that there is a proof netΠ of second ordermeLL that cannot have a representative Π in second order mL under any decora...
متن کاملAcyclicity and Coherence in Multiplicative Exponential Linear Logic
We give a geometric condition that characterizes MELL proof structures whose interpretation is a clique in non-uniform coherent spaces: visible acyclicity. We define the visible paths and we prove that the proof structures which have no visible cycles are exactly those whose interpretation is a clique. It turns out that visible acyclicity has also nice computational properties, especially it is...
متن کاملA Language For Multiplicative-additive Linear Logic
A term calculus for the proofs in multiplicative-additive linear logic is introduced and motivated as a programming language for channel based concurrency. e term calculus is proved complete for a semantics in linearly distributive categories with additives. It is also shown that proof equivalence is decidable by showing that the cut elimination rewrites supply a conuent rewriting system modul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2004
ISSN: 0168-7433
DOI: 10.1023/b:jars.0000029976.22387.ac